Some APX-completeness results for cubic graphs
نویسندگان
چکیده
منابع مشابه
Max-leaves spanning tree is APX-hard for cubic graphs
We consider the problem of finding a spanning tree with maximum number of leaves (MaxLeaf). A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3 (cubic graphs). MaxLeaf is known to be APX-hard in general, and NP-hard for cubic graphs. We show that the problem is also APX-hard for cubic graphs. The APX-...
متن کاملCompleteness results for metrized rings and lattices
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...
متن کاملCompleteness in approximation classes beyond APX
We present a reduction that allows us to establish completeness results for several approximation classes mainly beyond APX. Using it, we extend one of the basic results of S. Khanna, R. Motwani, M. Sudan, and U. Vazirani (On syntactic versus computational views of approximability, SIAM J. Comput., 28:164–191, 1998) by proving the existence of complete problems for the whole Log-APX, the class ...
متن کاملOn incidence coloring for some cubic graphs
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with ∆+2 colors, where ∆ is the maximum degree of a graph. Although this conjecture was solved in the negative by an example in [1], it might hold for some special classes of graphs. In this paper, we consider graphs with maximum degree ∆ = 3 and show that the conjecture holds for cubic Hamiltonian graphs and some...
متن کاملSome Completeness Results for Compactly Surjective Subgroups
Suppose κk,Z(ξ̄) ∼ ‖L ‖. M. Williams’s construction of unconditionally solvable sets was a milestone in Euclidean analysis. We show that F ⊃ −1. Next, in this context, the results of [24] are highly relevant. Recent developments in symbolic operator theory [24] have raised the question of whether Z < j.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00158-3